An optimal algorithm for roundness determination on convex polygons
نویسندگان
چکیده
منابع مشابه
An Optimal Algorithm for Roundness Determination on Convex Polygons
In tolerancing, the Out-Of-Roundness factor determines the relative circularity of planar shapes. The measurement of concern in this work is the Minimum Radial Separation, as recommended by the American National Standards Institute (ANSI). Here we show that the algorithm given in Le and Lee [6] runs in /9(n 2) time even for convex polygons. Furthermore, we present an optimal O(n) time algorithm...
متن کاملAn optimal algorithm for bandit convex optimization
We consider the problem of online convex optimization against an arbitrary adversary with bandit feedback, known as bandit convex optimization. We give the first Õ( √ T )-regret algorithm for this setting based on a novel application of the ellipsoid method to online learning. This bound is known to be tight up to logarithmic factors. Our analysis introduces new tools in discrete convex geometry.
متن کاملOptimal space coverage with white convex polygons
Assume that we are given a set of points some of which are black and the rest are white. The goal is to find a set of convex polygons with maximum total area that cover all white points and exclude all black points. We study the problem on three different settings (based on overlapping between different convex polygons): (1) In case convex polygons are permitted to have common area, we present ...
متن کاملAn Optimal Algorithm for Finding the Separation of Simple Polygons
Abs t rac t . Given simple polygons P and Q, their separagion, denoted by a(P, Q), is defined to be the minimum distance between their boundaries. We present an optimal O(N) algorithm for determining the separation of two simple polygons P and Q, where [P[ § [Q[ = [N[. The best previous algorithm for this problem is due to Kirkpatrick and has complexity O(N log N). In addition, a parallel versi...
متن کاملNew Results on Optimal Area Triangulations of Convex Polygons
We consider the problems of finding two optimal triangulations of convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programmi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1995
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00004-6